Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs

Wavelength Add - Drop Multiplexing for Minimizing SONET

Minimizing Drop Cost for SONET / WDMNetworks with 18 Wavelength

SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a `grooming', consisting of unions of certain primitive rings. The existence of such decompositions when every pair of sites employs no more than 1 8 of the wavelength capacity is determined , with few possible exceptions, when the ring size is a multiple of four.

Minimizing drop cost for SONET/WDM networks with wavelength requirements

SONET/WDM networks using wavelength add–drop multiplexing can be constructed using certain graph decompositions used to form a “grooming,” consisting of unions of certain primitive rings. The existence of such decompositions when every pair of sites employs no more than 8 of the wavelength capacity is determined, with few possible exceptions, when the ring size is a multiple of four. The techni...

Better Bounds for Minimizing SONET ADMs

SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and wavelength assignment of the traffic streams. Following previous work, we consider the problem where the route of each traffic stream is given as input, and we need to assign wavelengths so as to minimize the total nu...

Wavelength Assignment in WDM Rings to Minimize SONET ADMs

We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation complexity remains unknown, and the only known heuristic [6] which does not allow the splitting of lightpaths is problematic in both the algorithm itself and its performance analysis. We first prove the NP-completeness of this...